Parallel incomplete factorizations with pseudo-overlapped subdomains
نویسندگان
چکیده
منابع مشابه
Spectral analysis of parallel incomplete factorizations with implicit pseudo-overlap
Two general parallel incomplete factorization strategies are investigated. The techniques may be interpreted as local re-numberings of nodes, combined with suitable ll level in a (successful) attempt to overcome the well-known trade-oo between high parallelism (locality) and fast convergence (globality). Spectral analysis is provided, which displays how the condition number depends on the numbe...
متن کاملAnalysis of Parallel Incomplete Point Factorizations
Incomplete point factorizations are analyzed regarding their parallelism and the norm of the error matrix, and the relation between the two. This paper has appeared in Linear Algebra and its Applications, 1991
متن کاملApproximate and Incomplete Factorizations
In this chapter, we give a brief overview of a particular class of preconditioners known as incomplete factorizations. They can be thought of as approximating the exact LU factorization of a given matrix A (e.g. computed via Gaussian elimination) by disallowing certain ll-ins. As opposed to other PDE-based preconditioners such as multigrid and domain decomposition, this class of preconditioners...
متن کاملIncremental incomplete LU factorizations with applications
This paper addresses the problem of computing preconditioners for solving linear systems of equations with a sequence of slowly varying matrices. This problem arises in many important applications. For example, a common situation in computational fluid dynamics, is when the equations change only slightly, possibly in some parts of the physical domain. In such situations it is wasteful to recomp...
متن کاملIncomplete Cholesky Factorizations with Limited Memory
We propose an incomplete Cholesky factorization for the solution of large-scale trust region subproblems and positive definite systems of linear equations. This factorization depends on a parameter p that specifies the amount of additional memory (in multiples of n, the dimension of the problem) that is available; there is no need to specify a drop tolerance. Our numerical results show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2001
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(01)00082-5